Tootfinder

Unveiling Behavioral Transparency of Protocols Communicated by IoT Networked Assets (Full Version)
Savindu Wannigama (Department of Computer Engineering, University of Peradeniya, Sri Lanka), Arunan Sivanathan (School of EE&T, UNSW Sydney, Australia), Ayyoob Hamza (School of EE&T, UNSW Sydney, Australia), Hassan Habibi Gharakheili (School of EE&T, UNSW Sydney, Australia)

Unveiling Behavioral Transparency of Protocols Communicated by IoT Networked Assets (Full Version)
Behavioral transparency for Internet-of-Things (IoT) networked assets involves two distinct yet interconnected tasks: (a) characterizing device types by discerning the patterns exhibited in their network traffic, and (b) assessing vulnerabilities they introduce to the network. While identifying communication protocols, particularly at the application layer, plays a vital role in effective network management, current methods are, at best, ad-hoc. Accurate protocol identification and attribute ex…

Attention-aware Semantic Communications for Collaborative Inference
Jiwoong Im, Nayoung Kwon, Taewoo Park, Jiheon Woo, Jaeho Lee, Yongjune Kim
https://arxiv.org/abs/2404.07217

Attention-aware Semantic Communications for Collaborative Inference
We propose a communication-efficient collaborative inference framework in the domain of edge inference, focusing on the efficient use of vision transformer (ViTs) models. The partitioning strategy of conventional collaborative inference fails to reduce communication cost because of the inherent architecture of ViTs maintaining consistent layer dimensions across the entire transformer encoder. Therefore, instead of employing the partitioning strategy, our framework utilizes a lightweight ViT mod…

The lower $p$-series of analytic pro-$p$ groups and Hausdorff dimension
Iker de las Heras, Benjamin Klopsch, Anitha Thillaisundaram
https://arxiv.org/abs/2402.06876

The lower $p$-series of analytic pro-$p$ groups and Hausdorff dimension
Let $G$ be a $p$-adic analytic pro-$p$ group of dimension $d$. We produce an approximate series which descends regularly in strata and whose terms deviate from the lower $p$-series in a uniformly bounded way. This brings to light a new set of rational invariants, canonically associated to $G$, that yield the aforementioned uniform bound and that restrict the possible values for the Hausdorff dimensions of closed subgroups of $G$ with respect to the lower $p$-series. In particular, the Hausdorff…

Session Types for the Transport Layer: Towards an Implementation of TCP
Samuel Cavoj (University of Glasgow), Ivan Nikitin (University of Glasgow), Colin Perkins (University of Glasgow), Ornela Dardha (University of Glasgow)
https://arxiv.org/abs/2404.05478

Session Types for the Transport Layer: Towards an Implementation of TCP
Session types are a typing discipline used to formally describe communication-driven applications with the aim of fewer errors and easier debugging later into the life cycle of the software. Protocols at the transport layer such as TCP, UDP, and QUIC underpin most of the communication on the modern Internet and affect billions of end-users. The transport layer has different requirements and constraints compared to the application layer resulting in different requirements for verification. Despi…

Coalgebraic Modal Logic for Dynamic Systems with Uncertainty
Andr\'es Gallardo, Ignacio Viglizzo
https://arxiv.org/abs/2403.06177 https://

Coalgebraic Modal Logic for Dynamic Systems with Uncertainty
In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures, finitely additive probability measures, plausibilty measures (and their duals, belief functions), and possibility measures. We give axioms and inference rules for the associated system of coalgebraic modal logic, and construct the canonical coalgebras to prove a…

Enhancing Physical Layer Security in Dual-Function Radar-Communication Systems with Hybrid Beamforming Architecture
Lingyun Xu, Bowen Wang, Jieming Shi, Huiyong Li, Ziyang Cheng
https://arxiv.org/abs/2403.07655

Enhancing Physical Layer Security in Dual-Function Radar-Communication Systems with Hybrid Beamforming Architecture
In this letter, we investigate enhancing the physical layer security (PLS) for the dual-function radar-communication (DFRC) system with hybrid beamforming (HBF) architecture, where the base station (BS) achieves downlink communication and radar target detection simultaneously. We consider an eavesdropper intercepting the information transmitted from the BS to the downlink communication users with imperfectly known channel state information. Additionally, the location of the radar target is also…

Channel Estimation Considerate Precoder Design for Multi-user Massive MIMO-OFDM Systems: The Concept and Fast Algorithms
Liu Junkai, Jiang Yi
https://arxiv.org/abs/2403.06072

Channel Estimation Considerate Precoder Design for Multi-user Massive MIMO-OFDM Systems: The Concept and Fast Algorithms
The sixth-generation (6G) communication networks target peak data rates exceeding 1Tbps, necessitating base stations (BS) to support up to 100 simultaneous data streams. However, sparse pilot allocation to accommodate such streams poses challenges for users' channel estimation. This paper presents Channel Estimation Considerate Precoding (CECP), where BS precoders prioritize facilitating channel estimation alongside maximizing transmission rate. To address the computational complexity of 6G lar…

This https://arxiv.org/abs/2402.15686 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Lower bounds for quantum-inspired classical algorithms via communication complexity
Quantum-inspired classical algorithms provide us with a new way to understand the computational power of quantum computers for practically-relevant problems, especially in machine learning. In the past several years, numerous efficient algorithms for various tasks have been found, while an analysis of lower bounds is still missing. Using communication complexity, in this work we propose the first method to study lower bounds for these tasks. We mainly focus on lower bounds for solving linear re…

Arakelov-Green's functions for dynamical systems on projective varieties
Nicole R. Looper
https://arxiv.org/abs/2404.06981 https://

Arakelov-Green's functions for dynamical systems on projective varieties
We introduce functions associated to polarized dynamical systems that generalize averages of the dynamical Arakelov-Green's functions for rational functions due to Baker and Rumely. For a polarized dynamical system $X\to X$ over a product formula field, we prove an Elkies-style lower bound for these functions evaluated on the adelic points of $X$. As an application, we prove a Lehmer-type lower bound on the canonical height of a non-torsion point $P$ on an abelian variety $A/K$, where $K$ is a …

Revisiting Data Recovery Loops in 6G Networks
Uyoata E. Uyoata, Abolfazl Amiri, Enric Juan, Guillermo Pocovi, Pilar Andres-Maldonado, Klaus I. Pedersen, Troels Kolding
https://arxiv.org/abs/2404.07579

Revisiting Data Recovery Loops in 6G Networks
Mechanisms for data recovery and packet reliability are essential components of the upcoming 6th generation (6G) communication system. In this paper, we evaluate the interaction between a fast hybrid automatic repeat request (HARQ) scheme, present in the physical and medium access control layers, and a higher layer automatic repeat request (ARQ) scheme which may be present in the radio link control layer. Through extensive system-level simulations, we show that despite its higher complexity, a …